By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 26, Issue 6, pp. 1559-1803

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms

Philip D. MacKenzie

pp. 1559-1580

Reconfiguring Arrays with Faults Part I: Worst-Case Faults

Richard J. Cole, Bruce M. Maggs, and Ramesh K. Sitaraman

pp. 1581-1611

Matrix Searching with the Shortest-Path Metric

John Hershberger and Subhash Suri

pp. 1612-1634

Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory

Joseph Cheriyan

pp. 1635-1655

Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms

Amihood Amir and Dmitry Keselman

pp. 1656-1669

The Union of Convex Polyhedra in Three Dimensions

Boris Aronov, Micha Sharir, and Boaz Tagansky

pp. 1670-1688

Star Unfolding of a Polytope with Applications

Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, and Catherine A. Schevon

pp. 1689-1713

Computing Envelopes in Four Dimensions with Applications

Pankaj K. Agarwal, Boris Aronov, and Micha Sharir

pp. 1714-1732

A Spectral Technique for Coloring Random 3-Colorable Graphs

Noga Alon and Nabil Kahale

pp. 1733-1748

A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies

Sampath Kannan and Tandy Warnow

pp. 1749-1763

Fault-Tolerant Meshes with Small Degree

Jehoshua Bruck, Robert Cypher, and Ching-Tien Ho

pp. 1764-1784

On Translational Motion Planning of a Convex Polyhedron in 3-Space

Boris Aronov and Micha Sharir

pp. 1785-1803